Xk-Digraphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Open MPI for Cray XE/XK Systems

Open MPI provides an implementation of the MPI standard supporting communication over a range of highperformance network interfaces. Recently, Oak Ridge National Laboratory (ORNL) and Los Alamos National Laboratory (LANL) collaborated on creating a port of Open MPI for Gemini, the network interface for Cray XE and XK systems. In this paper, we present our design and implementation of Open MPI’s...

متن کامل

More skew-equienergetic digraphs

Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this  paper, we give some new methods to construct new skew-equienergetic digraphs.

متن کامل

Epidemiology of XK Typhus in Jamshedpur

Jamshedpur is an industrial town with a population of nearly two lacs composed of both factory employees and non-employees, the for' mer predominating. The town is surrounded by cultivated and uncultivated lands all around, fringed by moderately high hills. The lay-out1 of the town consists mostly of bungalows and labourers' quarters with scrub or grass-land around the dwellings. The soil is ro...

متن کامل

The Closed Linear Span of { xk - ck

Let {ck) r be a given real sequence. We wish to determine, in the first instance, easily verified conditions on { ck > ;” which imply that the sequence of functions { 2 ck} p is total in C[O, 11; that is, that the closed linear span P{x”ck} is all of C[O, l] or, in other words, that every real function, continuous in [0, 11, is the limit, in the uniform norm, of a sequence of finite linear comb...

متن کامل

From subKautz digraphs to cyclic Kautz digraphs

Kautz digraphs K(d, `) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d, `) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed. In this paper we propose a new approach to cyclic Kautz digraphs by introducing the family ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1981

ISSN: 0095-8956

DOI: 10.1016/0095-8956(81)90059-9